Synchronization and simplification

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Anti-synchronization and synchronization of T-system

In this paper, we discuss the synchronization and anti-synchronization of two identical chaotic T-systems. The adaptive and nonlinear control schemes are used for the synchronization and anti-synchronization. The stability of these schemes is derived by Lyapunov Stability Theorem. Firstly, the synchronization and anti-synchronization are applied to systems with known parameters, then to systems...

متن کامل

Automated Simplification and Deduction

The commutative version of the Gröbner Basis Algorithm has become one of the most powerful tools in computer algebra. The recent adaptation of the algorithm to noncommuting variables has potential applications to matrix and operator expressions. A Forth-based research system was used to implement and study applications of a noncommutative variant of the Gröbner Basis Algorithm. It has been used...

متن کامل

2 Randomization and Simplification

Randomization may add beneficial flexibility to the construction of optimal simple decision rules in dynamic environments. A decision maker, restricted to the use of simple rules, may find a stochastic rule that strictly outperforms all deterministic ones. This is true even in highly separable Markovian environments where the set of feasible choices is stationary and the decision maker’s choice...

متن کامل

Simplification and Saving.

The daunting complexity of important financial decisions can lead to procrastination. We evaluate a low-cost intervention that substantially simplifies the retirement savings plan participation decision. Individuals received an opportunity to enroll in a retirement savings plan at a pre-selected contribution rate and asset allocation, allowing them to collapse a multidimensional problem into a ...

متن کامل

Topological Persistence and Simplification

We formalize a notion of topological simplification within the framework of a filtration, which is the history of a growing complex. We classify a topological change that happens during growth as either a feature or noise depending on its lifetime or persistence within the filtration. We give fast algorithms for computing persistence and experimental evidence for their speed and utility.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 1979

ISSN: 0012-365X

DOI: 10.1016/0012-365x(79)90164-x